Availability formulations for segment protection
نویسندگان
چکیده
منابع مشابه
Layered Protection of Availability
Of the three common objectives of information seurity availability is far less understood than con dentiality and integrity of information As threats against availability are too numerous to be identi ed a di ernt approach is required for the protection In this paper a layered protection of availability shall be established and the cost of protection shall be justi ed at each layer A very large...
متن کاملIntelligent shared-segment protection
Progress in network technologies and protocols is paving the road towards flexible optical transport networks, in which dynamic leasable circuits could be set up and released on a short-term basis according to customers’ requirements. Recently, new solutions for automatized network management promise to allow customers to specify the terms of the service level agreement (SLA) to be guaranteed (...
متن کاملAvailability of pediatric-evaluated formulations in Serbia
OBJECTIVES The aim of this study is to analyze the availability and coverage by health insurance reimbursement of pediatric formulations labeled for children up to the age of 12 in Serbia. To provide good insight in general availability of pediatric medicines, results were compared with the World Health Organization's (WHO) "Model List of Essential Medicines for Children" and with published evi...
متن کاملNovel algorithms for shared segment protection
The major challenges in designing survivable schemes are how to allocate minimal amount of spare resources (e.g., bandwidth) using fast (e.g., polynomial-time) algorithms, and in case a failure occurs, to be able to quickly recover from it. All existing approaches invariably make tradeoffs. In this paper, we propose novel shared segment protection algorithms which make little or no compromise. ...
متن کاملLinear Formulation for Segment Shared Protection
This paper proposes a novel linear formulation for the problem of segment shared protection, where the switching/merging nodes and the least-cost link-disjoint working and protection segments corresponding to each switching/merging node-pair are jointly determined for a connection request. A novel approach of arc-reversal graph transformation is introduced. We verify the ILP and compare it with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2010
ISSN: 0090-6778
DOI: 10.1109/tcomm.2010.04.080103